On Perfect 2-Colorings of Johnson GraphsJ(v, 3)
نویسندگان
چکیده
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملOn locally-perfect colorings
A (proper) coloring of a finite simple graph (G) is pe#ect if it uses exactly o(G) colors, where o(G) denotes the order of a largest clique in G. A coloring is locally-perfect [3] if it induces on the neighborhood of every vertex v a perfect coloring of this neighborhood. A graph G is perfect (resp. locally-petfect) if every induced subgraph admits a perfect (resp. locally-perfect) coloring. Pr...
متن کاملOn perfect 2-colorings of the q-ary n-cube
A coloring of a q-ary n-dimensional cube (hypercube) is called perfect if, for every n-tuple x, the collection of the colors of the neighbors of x depends only on the color of x. A Boolean-valued function is called correlation-immune of degree n − m if it takes value 1 the same number of times for each m-dimensional face of the hypercube. Let f = χ S be a characteristic function of a subset S o...
متن کاملOn Perfect Codes in the Johnson Graph
In this paper we consider the existence of nontrivial perfect codes in the Johnson graph J(n, w). We present combinatorial and number theory techniques to provide necessary conditions for existence of such codes and reduce the range of parameters in which 1-perfect and 2-perfect codes may exist.
متن کاملBackbone colorings along perfect matchings
Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex coloring V → {1, 2, . . .} of G in which the colors assigned to adjacent vertices in H differ by at least two. In a recent paper, backbone colorings were introduced and studied in cases were the backbone is either a spanning tree or a spanning path. Here we study the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2012
ISSN: 1063-8539
DOI: 10.1002/jcd.21327